Subgame perfect equilibria in stopping games
نویسنده
چکیده
Stopping games (without simultaneous stopping) are sequential games in which at every stage one of the players is chosen according to a stochastic process, and that player decides whether to continue the interaction or stop it, whereby the terminal payoff vector is obtained by another stochastic process. We prove that if the payoff process is integrable, a δ-approximate subgame perfect -equilibrium exists; that is, there exists a strategy profile that is an -equilibrium in all subgames, except possibly in a set of subgames that occurs with probability smaller than δ (even after deviation by some of the players).
منابع مشابه
Symmetric equilibria in stochastic timing games
We construct subgame-perfect equilibria with mixed strategies for symmetric stochastic timing games with arbitrary strategic incentives. The strategies are qualitatively different for local firstor second-mover advantages, which we analyse in turn. When there is a local second-mover advantage, the players may conduct a war of attrition with stopping rates that we characterize in terms of the Sn...
متن کاملOn (Subgame Perfect) Secure Equilibrium in Quantitative Reachability Games
We study turn-based quantitative multiplayer non zero-sum games played on finite graphs with reachability objectives. In such games, each player aims at reaching his own goal set of states as soon as possible. A previous work on this model showed that Nash equilibria (resp. secure equilibria) are guaranteed to exist in the multiplayer (resp. two-player) case. The existence of secure equilibria ...
متن کاملSubgame Perfection for Equilibria in Quantitative Reachability Games
We study turn-based quantitative multiplayer non zero-sum games played on finite graphs with reachability objectives. In such games, each player aims at reaching his own goal set of states as soon as possible. A previous work on this model showed that Nash equilibria (resp. secure equilibria) are guaranteed to exist in the multiplayer (resp. two-player) case. The existence of secure equilibria ...
متن کاملNoncooperative foundations of stable sets in voting games
This note investigates the noncooperative foundations of von Neumann-Morgenstern (vN-M) stable sets in voting games. To do so, we study subgame perfect equilibria of a noncooperative legislative bargaining game, based on underlying simple games. The following results emerge from such an exercise: Every stable set of the underlying simple game is the limit set of undominated pure-strategy Markov...
متن کاملSubgame Perfect Equilibria and Communication in Stage Games
Any stage-game with in nite choice sets can be approximated by nite games obtained as increasingly ner discretizations of the in nite game. The subgame perfect equilibrium outcomes of the nite games converge to a limit distribution. We prove that (i) if the limit distribution is feasible in the limit game, then it is also a subgame perfect equilibrium outcome of the limit game; and (ii) if the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Int. J. Game Theory
دوره 43 شماره
صفحات -
تاریخ انتشار 2014